1 QR Probabilistic Cryptosystem
نویسنده
چکیده
Let n = pq, p, q distinct odd primes. We can divide the numbers in Zn into four classes depending on their membership in QRp and QRq. Let Q11 n be those numbers that are quadratic residues mod both p and q; let Q10 n be those numbers that are quadratic residues mod p but not mod q; let Q 01 n be those numbers that are quadratic residues mod q but not mod p; and let Q00 n be those numbers that are neither quadratic residues mod p nor mod q. Under these definitions, Q11 n = QRn and Q00 n ∪Q01 n ∪Q10 n = QNRn.
منابع مشابه
A Complete Public-Key Cryptosystem
We present a cryptosystem which is complete for the class of probabilistic public-key cryptosystems with bounded error. Besides traditional encryption schemes such as RSA and El Gamal, this class contains probabilistic encryption of Goldwasser-Micali as well as Ajtai-Dwork and NTRU cryptosystems. The latter two are known to make errors with some small positive probability. To our best knowledge...
متن کاملProbabilistic encryption goldwasser pdf
We replace deterministic block encryption by probabilistic encryption of single. This property enabled Goldwasser and Micali ill to device a scheme for Mental.A new probabilistic model of data encryption is introduced. Laboratory of.presenting the first probabilistic cryptosystem by Goldwasser and Micali.
متن کاملNew probabilistic public-key encryption based on the RSA cryptosystem
We propose a novel probabilistic public-key encryption, based on the RSA cryptosystem. We prove that in contrast to the (standardmodel) RSA cryptosystem each user can choose his own encryption exponent from a more extensive set of positive integers than it can be done by the creator of the concrete RSA cryptosystem who chooses and distributes encryption keys among all users. Moreover, we show t...
متن کاملConstruction of A New Class of Linear Multivariate Public Key Cryptosystem, K(I)SE(1)PKC
In this paper, we present a new class of linear multivariate PKC referred to as K(I)SE(1)PKC. We shall show that K(I)SE(1)PKC, a linear multivariate PKC, can be sufficiently secure against any linear transformation attack due to the probabilistic structure. We show that the probabilistic structure can be successfully introduced by the use of the Chinese Remainder Theorem.
متن کاملSymplectic Lattice Reduction and NTRU
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. This article is motivated by an interesting peculiar property of NTRU lattices. Namely, we show that NTRU lattices are proportional to the so-called symplectic lattices. This suggests to try to adapt the classical reduc...
متن کامل